15 research outputs found

    Learning automata and sigma imperialist competitive algorithm for optimization of single and multi-objective functions

    Get PDF
    Evolutionary Algorithms (EA) consist of several heuristics which are able to solve optimisation tasks by imitating some aspects of natural evolution. Two widely-used EAs, namely Harmony Search (HS) and Imperialist Competitive Algorithm (ICA), are considered for improving single objective EA and Multi Objective EA (MOEA), respectively. HS is popular because of its speed and ICA has the ability for escaping local optima, which is an important criterion for a MOEA. In contrast, both algorithms have suffered some shortages. The HS algorithm could be trapped in local optima if its parameters are not tuned properly. This shortage causes low convergence rate and high computational time. In ICA, there is big obstacle that impedes ICA from becoming MOEA. ICA cannot be matched with crowded distance method which produces qualitative value for MOEAs, while ICA needs quantitative value to determine power of each solution. This research proposes a learnable EA, named learning automata harmony search (LAHS). The EA employs a learning automata (LA) based approach to ensure that HS parameters are learnable. This research also proposes a new MOEA based on ICA and Sigma method, named Sigma Imperialist Competitive Algorithm (SICA). Sigma method provides a mechanism to measure the solutions power based on their quantity value. The proposed LAHS and SICA algorithms are tested on wellknown single objective and multi objective benchmark, respectively. Both LAHS and MOICA show improvements in convergence rate and computational time in comparison to the well-known single EAs and MOEAs

    Optimal design of plate-fin heat exchangers by a hybrid evolutionary algorithm

    No full text
    This study explores the first application of a Genetic Algorithm hybrid with Particle Swarm Optimization (GAHPSO) for design optimization of a plate-fin heat exchanger. A total number of seven design parameters are considered as the optimization variables and the constraints are handled by penalty function method. The effectiveness and accuracy of the proposed algorithm is demonstrated through an illustrative example. Comparing the results with the corresponding results using GA and PSO reveals that the GAHPSO can converge to optimum solution with higher accuracy

    A hybrid genetic algorithm and chaotic function model for image encryption

    No full text
    The security of digital images has attracted much attention recently. In this study, a new method based on a hybrid model is proposed for image encryption. The hybrid model is composed of a genetic algorithm and a chaotic function. In the first stage of the proposed method, a number of encrypted images are constructed using the original image and the chaotic function. In the next stage, these encrypted images are used as the initial population for the genetic algorithm. In each stage of the genetic algorithm, the answer obtained from the previous iteration is optimized to produce the best-encrypted image. The best-encrypted image is defined as the image with the highest entropy and the lowest correlation coefficient among adjacent pixels. The use of genetic algorithms in image encryption has been attempted for the first time in this paper. Analyzing the results from the performed experiments, a high level of resistance of the proposed method against brute-force and statistical invasions is obviously illustrated. The obtained entropy and correlation coefficients of the method are approximately 7.9978 and -0.0009, respectively

    Chaos-based image encryption using a hybrid genetic algorithm and a DNA sequence

    No full text
    The paper studies a recently developed evolutionary-based image encryption algorithm. A novel image encryption algorithm based on a hybrid model of deoxyribonucleic acid (DNA) masking, a genetic algorithm (GA) and a logistic map is proposed. This study uses DNA and logistic map functions to create the number of initial DNA masks and applies GA to determine the best mask for encryption. The significant advantage of this approach is improving the quality of DNA masks to obtain the best mask that is compatible with plain images. The experimental results and computer simulations both confirm that the proposed scheme not only demonstrates excellent encryption but also resists various typical attacks

    A robust learning based evolutionary approach for thermal-economic optimization of compact heat exchangers

    No full text
    This paper presents a robust, efficient and parameter-setting-free evolutionary approach for the optimal design of compact heat exchangers. A learning automata based particle swarm optimization (LAPSO) is developed for optimization task. Seven design parameters, including discreet and continuous ones, are considered as optimization variables. To make the constraint handling straightforward, a self-adaptive penalty function method is employed. The efficiency and the accuracy of the proposed method are demonstrated through two illustrative examples that include three objectives, namely minimum total annual cost, minimum weight and minimum number of entropy generation units. Numerical results indicate that the presented approach generates the optimum configuration with higher accuracy and a higher success rate when compared with genetic algorithms (GAs) and particle swarm optimization (PSO)

    Short-term load forecasting using a hybrid model with a refined exponentially weighted fuzzy time series and an improved harmony search

    No full text
    This article discusses the proposal of an enhanced hybrid algorithm. The algorithm focuses on a sophisticated exponentially weighted fuzzy algorithm that is aligned with an enhanced harmony search. Short-term load forecasting can be performed appropriately with this specific method. The initial phase of this research discusses the recognition of the fuzzy logical relationship order with the aim of autocorrelation analysis. The second phase aims at obtaining the optimal intervals and coefficients for adoption using training data set. The last phase seeks to apply the obtained information and attempts to predict a 48-step-ahead on Short term load forecasting (STLF) problems. It is essential to validate this process. To achieve this goal, eight case studies of actual load data from France and Britain (from 2005) were employed. These data were applied to both the developed algorithm and certain improved STLF predicting models. The subsequent errors from these models were compared. The results of the error analysis exhibit the advantages of the developed algorithm with respect to its prediction preciseness

    A novel chaotic based image encryption using a hybrid model of deoxyribonucleic acid and cellular automata

    No full text
    Currently, there are many studies have conducted on developing security of the digital image in order to protect such data while they are sending on the internet. This work aims to propose a new approach based on a hybrid model of the Tinkerbell chaotic map, deoxyribonucleic acid (DNA) and cellular automata (CA). DNA rules, DNA sequence XOR operator and CA rules are used simultaneously to encrypt the plain-image pixels. To determine rule number in DNA sequence and also CA, a 2-dimension Tinkerbell chaotic map is employed. Experimental results and computer simulations, both confirm that the proposed scheme not only demonstrates outstanding encryption, but also resists various typical attacks

    Heat load prediction in district heating systems with adaptive neuro-fuzzy method

    No full text
    District heating systems can play significant role in achieving stringent targets for CO2 emissions with concurrent increase in fuel efficiency. However, there are a lot of the potentials for future improvement of their operation. One of the potential domains is control and prediction. Control of the most district heating systems is feed forward without any feedback from consumers. With reliable predictions of consumers heat need, production could be altered to match the real consumers' needs. This will have effect on lowering the distribution cost, heat losses and especially on lowered return secondary and primary temperature which will result in increase of overall efficiency of combined heat and power plants. In this paper, to predict the heat load for individual consumers in district heating systems, an adaptive neuro-fuzzy inferences system (ANFIS) was constructed. Simulation results indicate that further improvements on model are needed especially for prediction horizons greater than 1

    A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem.

    No full text
    The Multi-Depot Vehicle Routing Problem (MDVRP) is an important variant of the classical Vehicle Routing Problem (VRP), where the customers can be served from a number of depots. This paper introduces a cooperative coevolutionary algorithm to minimize the total route cost of the MDVRP. Coevolutionary algorithms are inspired by the simultaneous evolution process involving two or more species. In this approach, the problem is decomposed into smaller subproblems and individuals from different populations are combined to create a complete solution to the original problem. This paper presents a problem decomposition approach for the MDVRP in which each subproblem becomes a single depot VRP and evolves independently in its domain space. Customers are distributed among the depots based on their distance from the depots and their distance from their closest neighbor. A population is associated with each depot where the individuals represent partial solutions to the problem, that is, sets of routes over customers assigned to the corresponding depot. The fitness of a partial solution depends on its ability to cooperate with partial solutions from other populations to form a complete solution to the MDVRP. As the problem is decomposed and each part evolves separately, this approach is strongly suitable to parallel environments. Therefore, a parallel evolution strategy environment with a variable length genotype coupled with local search operators is proposed. A large number of experiments have been conducted to assess the performance of this approach. The results suggest that the proposed coevolutionary algorithm in a parallel environment is able to produce high-quality solutions to the MDVRP in low computational time

    A self-adaptive evolutionary fuzzy model for load forecasting problems on smart grid environment.

    No full text
    The importance of load forecasting has been increasing lately and improving the use of energy resources remains a great challenge. The amount of data collected from Microgrid (MG) systems is growing while systems are becoming more sensitive, depending on small changes in the daily routine. The need for flexible and adaptive models has been increased for dealing with these problems. In this paper, a novel hybrid evolutionary fuzzy model with parameter optimization is proposed. Since finding optimal values for the fuzzy rules and weights is a highly combinatorial task, the parameter optimization of the model is tackled by a bio-inspired optimizer, so-called GES, which stems from a combination between two heuristic approaches, namely the Evolution Strategies and the GRASP procedure. Real data from electric utilities extracted from the literature are used to validate the proposed methodology. Computational results show that the proposed framework is suitable for short-term forecasting over microgrids and large-grids, being able to accurately predict data in short computational time. Compared to other hybrid model from the literature, our hybrid metaheuristic model obtained better forecasts for load forecasting in aMG scenario, reporting solutions with low variability of its forecasting errors
    corecore